Continuous Time Markov Processes on Graphs
نویسنده
چکیده
We study continuous time Markov processes on graphs. The notion of frequency is introduced, which serves well as a scaling factor between any Markov time of a continuous time Markov process and that of its jump chain. As an application, we study “multi-person simple random walks” on a graph G with n vertices. There are n persons distributed randomly at the vertices of G. In each step of this discrete time Markov process, we randomly pick up a person and move it to a random adjacent vertex. We give estimate on the expected number of steps for these n persons to meet all together at a specific vertex, given that they are at different vertices at the begininng. For regular graphs, our estimate is exact.
منابع مشابه
On $L_1$-weak ergodicity of nonhomogeneous continuous-time Markov processes
In the present paper we investigate the $L_1$-weak ergodicity of nonhomogeneous continuous-time Markov processes with general state spaces. We provide a necessary and sufficient condition for such processes to satisfy the $L_1$-weak ergodicity. Moreover, we apply the obtained results to establish $L_1$-weak ergodicity of quadratic stochastic processes.
متن کاملThe Inventory System Management under Uncertain Conditions and Time Value of Money
This study develops a inventory model to determine ordering policy for deteriorating items with shortages under markovian inflationary conditions. Markov processes include process whose future behavior cannot be accurately predicted from its past behavior (except the current or present behavior) and which involves random chance or probability. Behavior of business or economy, flow of traffic, p...
متن کاملBounds on the L2 Spectrum for Markov Chains and Markov Processes: a Generalization of Cheeger's Inequality
We prove a general version of Cheeger's inequality for discretetime Markov chains and continuous-time Markovian jump processes, both reversible and nonreversible, with general state space. We also prove a version of Cheeger's inequality for Markov chains and processes with killing. As an application, we prove L2 exponential convergence to equilibrium for random walk with inward drift on a class...
متن کاملContinuous-time quantum walks on semi-regular spidernet graphs via quantum probability theory
We analyze continuous-time quantum and classical random walk on spidernet lattices. In the framework of Stieltjes transform, we obtain density of states, which is an efficiency measure for the performance of classical and quantum mechanical transport processes on graphs, and calculate the spacetime transition probabilities between two vertices of the lattice. Then we analytically show that ther...
متن کاملLocal independence graphs for composable Markov processes
The concept of local independence is used to de ne local independence graphs representing the dynamic dependence structure of several continuous time processes which jointly form a so called composable Markov process Speci c properties of this new class of graphs are discussed such as the role of separating sets Further insight is gained by considering possible extensions to the discrete time s...
متن کامل